Dempster–Shafer theory framed in modal logic
نویسندگان
چکیده
منابع مشابه
Dempster-Shafer theory framed in modal logic
In this paper, the modal logic interpretation of plausibility and belief measures on an arbitrary universe of discourse, as proposed by Harmanec et al., is further developed by employing notions from set-valued analysis. In a model of modal logic, a multivalued mapping is constructed from the accessibility relation and a mapping determined by the value assignment function. This multivalued mapp...
متن کاملProof theory for modal logic
The axiomatic presentation of modal systems and the standard formulations of natural deduction and sequent calculus for modal logic are reviewed, together with the difficulties that emerge with these approaches. Generalizations of standard proof systems are then presented. These include, among others, display calculi, hypersequents, and labelled systems, with the latter surveyed from a closer p...
متن کاملModal Logic and Model Theory
We propose a first order modal logic, the QS?E-logic, obtained by adding to the well-known first order modal logic QS4 a rigidity axiom sch?mas : A -> O A, where A denotes a basic formula. In this logic, the possibility entails the possibility of extending a given classical first order model. This allows us to express some impor? tant concepts of classical model theory, such as existential comp...
متن کاملDoing Argumentation Theory in Modal Logic
The present paper applies well-investigated modal logics to provide formal foundations to specific fragments of argumentation theory. This logic-driven analysis of argumentation allows: first, to systematize several results of argumentation theory reformulating them within suitable formal languages; second, to import several techniques (calculi, model-checking, evaluation games, bisimulation ga...
متن کاملComputing Theory Prime Implicates in Modal Logic
The algorithm to compute theory prime implicates, a generalization of prime implicates, in propositional logic has been suggested in [16]. In this paper we have extended that algorithm to compute theory prime implicates of a knowledge base X with respect to another knowledge base Y using [2], where Y is a propositional knowledge base and X |= Y , in modal system T and we have also proved its co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Approximate Reasoning
سال: 1999
ISSN: 0888-613X
DOI: 10.1016/s0888-613x(99)00011-0